An efficient self-stabilizing distance-2 coloring algorithm
نویسندگان
چکیده
منابع مشابه
An Efficient Self-stabilizing Distance-2 Coloring Algorithm
We present a self-stabilizing algorithm for the distance-2 coloring problem that uses a constant number of variables on each node and that stabilizes in O(Δm) moves using at most Δ + 1 colors, where Δ is the maximum degree in the graph and m is the number of edges in the graph. The analysis holds true both for the sequential and the distributed adversarial daemon model. This should be compared ...
متن کاملMemory Efficient Self-stabilizing Distance-k Independent Dominating Set Construction
We propose a memory efficient self-stabilizing protocol building distance-k independent dominating sets. A distance-k independent dominating set is a distance-k independent set and a distance-k dominating set. Our algorithm, named SID, is silent; it converges under the unfair distributed scheduler (the weakest scheduling assumption). The protocol SID is memory efficient : it requires only log(2...
متن کاملA Self-Stabilizing Algorithm for Finding a Minimal Distance-2 Dominating Set in Distributed Systems
The study of various dominating set problems is an important area within graph theory. In applications, a dominating set in a system can be considered as an ideal place for allocating resources. And, a minimal dominating set allows allocating a smaller number of resources. Distance-versions of the concept of minimal dominating sets are more applicable to modeling real-world problems, such as pl...
متن کاملA Memory Efficient Self-stabilizing Algorithm for Maximal k -Packing
The k-packing problem asks for a subset S of the nodes in a graph such that the distance between any pair of nodes in S is greater than k. This problem has applications to placing facilities in a network. In the current paper we present a self-stabilizing algorithm for computing a maximal k-packing in a general graph. Our algorithm uses a constant number of variables per node. This improves the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.01.034